Shape Recognition by Clustering and Matching of Skeletons
نویسندگان
چکیده
We perform the task of shape recognition using a skeleton based method. Skeleton of the shape is considered as a free tree and is represented by a connectivity graph. Geometric features of the shape are captured using Radius function along the skeletal curve segments. Matching of the connectivity graphs based on their topologies and geometric features gives a distance measure for determining similarity or dissimilarity of the shapes. Then the distance measure is used for clustering and classification of the shapes by employing hierarchical clustering methods. Moreover, for each class, a median skeleton is computed and is located as the indicator of its related class. The resulted hierarchy of the shapes classes and their indicators are used for the task of shape recognition. This is performed for any given shape by a top-down traversing of the resulted hierarchy and matching with the indicators. We evaluate the proposed method by different shapes of silhouette datasets and we show how the method efficiently recognizes and classifies shapes.
منابع مشابه
Binary shape recognition using the morphological skeleton transform
-Binary image representation by its morphological skeleton transform has been proposed in the past as an information preserving representation. In this paper this skeleton representation is adopted as the start point for the development of a binary shape recognition scheme. A skeleton matching algorithm is presented that efficiently characterizes the similarity between two skeletons as a distan...
متن کاملThe multiresolution gradient vector field skeleton
Many algorithms suppress skeleton associated with boundary perturbation by preventing their formation or by costly branch pruning. This work proposes a novel concept of structural and textural skeletons. The former is associated with the general shape structure and the latter with boundary perturbations. These skeletons remain disconnected to facilitate gross shape matching without the need for...
متن کاملCoarse-to-Fine Matching of Shapes Using Disconnected Skeletons by Learning Class-Specific Boundary Deformations
Disconnected skeleton [1] is a very coarse yet a very stable skeleton-based representation scheme for generic shape recognition in which recognition is performed mainly based on the structure of disconnection points of extracted branches, without explicitly using information about boundary details [2, 3]. However, sometimes sensitivity to boundary details may be required in order to achieve the...
متن کاملHierarchic Voronoi skeletons
Robust and time-efficient skeletonization of a (planar) shape, which is connectivity preserving and based on Euclidean metrics, can be achieved by first regularizing the Voronoi diagram (VD) of a shape’s boundary points, i.e., by removal of noise-sensitive parts of the tessellation and then by establishing a hierarchic organization of skeleton constituents . Each component of the VD is attribut...
متن کاملComparison of curve and surface skeletonization methods for voxel shapes
Surface and curve skeletons are important shape descriptors with applications in shape matching, simplification, retrieval, and animation. In recent years, many surface and curve skeletonization methods for 3D shapes have been proposed. However, practical comparisons of such methods against each other and against given quality criteria are quite limited in the literature. In this paper, we comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JCP
دوره 3 شماره
صفحات -
تاریخ انتشار 2008